Experimental Software Schedulability Estimation for Varied Processor Frequencies
نویسندگان
چکیده
Processor Frequencies Sampsa Fabritius Raimondas Lencevicius Edu Metz Alexander Ran Nokia Mobile Phones, Sinitaival 5, FIN-33720 Tampere, Finland Nokia Research Center, 5 Wayside Road, Burlington, MA 01803, USA [email protected] [email protected] [email protected] [email protected] Abstract. This paper describes a new approach to experimentally estimate the application schedulability for various processor frequencies. We use additional workload generated by an artificial high priority routine to simulate the frequency decrease of a processor. Then we estimate the schedulability of applications at different frequencies. The results of such estimation can be used to determine the frequencies and control algorithms of dynamic voltage scaling/dynamic frequency scaling (DVS/DFS) implementations. The paper presents a general problem description, the proposed schedulability estimation method, its analysis and evaluation.
منابع مشابه
Efficient Online Schedulability Tests for Real-Time Systems
Many computer systems, such as those for open system environments or multimedia services, need an efficient schedulability test for on-line admission control of new jobs. Although various polynomial time schedulability tests have been proposed, they often fail to decide the schedulability of the system precisely when the system is heavily loaded. On the other hand, most precise schedulability t...
متن کاملDemand-based schedulability analysis for real-time multi-core scheduling
In real-time systems, schedulability analysis has been widely studied to provide offline guarantees on temporal correctness, producing many analysis methods. The demand-based schedulability analysis method has a great potential for high schedulability performance and broad applicability. However, such a potential is not yet fully realized for real-time multi-core scheduling mainly due to (i) th...
متن کاملShifting Real-Time Tasks towards Higher Schedulability
Virtually all major real-time operating systems such as QNX, VxWorks, LynxOS, and most real-time variants of Linux expose processor affinity APIs to restrict task migrations. Initially motivated by throughput and isolation reasons, the ability to flexibly control migrations on a per-task basis has also proved to be useful from a schedulability perspective. However, as the motivation to use proc...
متن کاملAn Efficient On-line Job Admission Control Scheme to Guarantee Deadlines for QoS-Demanding Applications
Guaranteeing deadlines is essential in providing high levels of QoS (Quality of Service) in many networked applications that require timely processing and delivery of requested data. However, despite recent developments in real-time computing, current real-time scheduling theory cannot be directly applied to those applications since most real-time research has focused on the periodic task model...
متن کاملMulti-processor Schedulability Analysis of Preemptive Real-Time Tasks with Variable Execution Times
In this paper, we study schedulability analysis problems for multi-processor real-time systems. Assume a set of real time tasks whose execution times and deadlines are known. We use timed automata to describe the non-deterministic arrival times of tasks. The schedulability problem is to check whether the released task instances can be executed within their given deadlines on a multi-processor p...
متن کامل